Fractional aspects of the Erd\H{o}s-Faber-Lov\'asz Conjecture
نویسندگان
چکیده
منابع مشابه
Fractional aspects of the Erdös-Faber-Lovász Conjecture
The Erdős-Faber-Lovász conjecture is the statement that every graph that is the union of n cliques of size n intersecting pairwise in at most one vertex has chromatic number n. Kahn and Seymour proved a fractional version of this conjecture, where the chromatic number is replaced by the fractional chromatic number. In this note we investigate similar fractional relaxations of the Erdős-Faber-Lo...
متن کاملA clone-theoretic formulation of the Erdös-Faber-Lovász conjecture
The Erdős–Faber–Lovász conjecture states that if a graph G is the union of n cliques of size n no two of which share more than one vertex, then χ(G) = n. We provide a formulation of this conjecture in terms of maximal partial clones of partial operations on a set.
متن کاملA Proof of the Faber Intersection Number Conjecture
We prove the Faber intersection number conjecture and other more general results by using a recursion formula of n-point functions for intersection numbers on moduli spaces of curves. We also present several conjectural properties of Gromov-Witten invariants generalizing results on intersection numbers.
متن کاملThe Last Fraction of a Fractional Conjecture
Reed conjectured that for every ε > 0 and every integer ∆, there exists g such that the fractional total chromatic number of every graph with maximum degree ∆ and girth at least g is at most ∆ + 1 + ε. The conjecture was proven to be true when ∆ = 3 or ∆ is even. We settle the conjecture by proving it for the remaining cases.
متن کاملFractional Colouring and Hadwiger's Conjecture
This is easy for p 3, true but difficult for p=4 and 5 (in both cases [9, 6] it is equivalent to the four-colour theorem [1, 2, 7]), and open for p 6. It is therefore of interest to examine weakenings of (1.1). If G has no Kp+1 minor, the best upper bound known on its chromatic number is O( p(log p) ). This follows easily from the following theorem of Kostochka [5] or Thomason [8]. Article No. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2015
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1781